A family of binary completely transitive codes and distance-transitive graphs
نویسنده
چکیده
In this paper we construct new family of binary linear completely transitive (and, therefore, completely regular) codes. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ ≥ 2, there exist two codes in the constructed class of codes with d = 3, covering radius ρ and length ( 4 ρ 2 ) and ( 4 ρ+2 2 ) , respectively. These new completely transitive codes induce as coset graphs a family of distance-transitive graphs of growing diameter.
منابع مشابه
New families of completely transitive codes and distance transitive graphs
In this paper new infinite families of linear binary completely transitive codes are presented. They have covering radius ρ = 3 and 4, and are a half part of the binary Hamming and the binary extended Hamming code of length n = 2 − 1 and 2, respectively, where m is even. From these new completely transitive codes, in the usual way, i.e., as coset graphs, new presentations of infinite families o...
متن کاملFamilies of completely transitive codes and distance transitive graphs
In a previous work, the authors found new families of linear binary completely regular codes with the covering radius ρ = 3 and ρ = 4. In this paper, the automorphism groups of such codes are computed and it is proven that the codes are not only completely regular, but also completely transitive. From these completely transitive codes, in the usual way, i.e., as coset graphs, new presentations ...
متن کاملOn nested completely regular codes and distance regular graphs
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملCompletely Transitive Codes in Hamming Graphs
A code in a graph 0 is a non-empty subset C of the vertex set V of 0. Given C , the partition of V according to the distance of the vertices away from C is called the distance partition of C . A completely regular code is a code whose distance partition has a certain regularity property. A special class of completely regular codes are the completely transitive codes. These are completely regula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012